Explicit Constructions of Centrally Symmetric k-Neighborly Polytopes and Large Strictly Antipodal Sets
نویسندگان
چکیده
We present explicit constructions of centrally symmetric 2-neighborly d-dimensional polytopes with about 3 ≈ (1.73) vertices and of centrally symmetric k-neighborly d-polytopes with about 2 2 2 k vertices. Using this result, we construct for a fixed k ≥ 2 and arbitrarily large d and N , a centrally symmetric d-polytope with N vertices that has at least ( 1− k · (γk) ) ( N k ) faces of dimension k − 1, where γ2 = 1/ √ 3 ≈ 0.58 and γk = 2 2 2 k for k ≥ 3. Another application is a construction of a set of 3 − 1 points in R every two of which are strictly antipodal as well as a construction of an n-point set (for an arbitrarily large n) in R with many pairs of strictly antipodal points. The two latter results significantly improve the previous bounds by Talata, and Makai and Martini, respectively.
منابع مشابه
An Explicit Construction for Neighborly Centrally Symmetric Polytopes
A polytope P ⊂ R is centrally symmetric (cs, for short) if P = −P . A cs polytope P is k-neighborly if every set of k of its vertices, no two of which are antipodes, is the vertex set of a face of P . In their recent paper [7], Linial and Novik give probabilistic constructions for highly neighborly cs polytopes. Namely, based on probabilistic techniques due to Garnaev and Gluskin [4], they cons...
متن کاملCentrally symmetric polytopes with many faces
We present explicit constructions of centrally symmetric polytopes with many faces: (1) we construct a d-dimensional centrally symmetric polytope P with about 3d/4 ≈ (1.316)d vertices such that every pair of non-antipodal vertices of P spans an edge of P , (2) for an integer k ≥ 2, we construct a d-dimensional centrally symmetric polytope P of an arbitrarily high dimension d and with an arbitra...
متن کاملHow Neighborly Can a Centrally Symmetric Polytope Be?
We show that there exist k-neighborly centrally symmetric ddimensional polytopes with 2(n + d) vertices, where k(d, n) = Θ ( d 1 + log((d + n)/d) ) . We also show that this bound is tight.
متن کاملNeighborly inscribed polytopes and Delaunay triangulations
We prove that there are superexponentially many combinatorially distinct d-dimensional neighborly Delaunay triangulations on n points. These are the first examples of neighborly Delaunay triangulations that cannot be obtained via a stereographic projection of an inscribed cyclic polytope, and provide the current best lower bound for the number of combinatorial types of Delaunay triangulations. ...
متن کاملNeighborly Cubical Polytopes and Spheres
We prove that the neighborly cubical polytopes studied by Günter M. Ziegler and the first author [14] arise as a special case of the neighborly cubical spheres constructed by Babson, Billera, and Chan [4]. By relating the two constructions we obtain an explicit description of a non-polytopal neighborly cubical sphere and, further, a new proof of the fact that the cubical equivelar surfaces of M...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete & Computational Geometry
دوره 49 شماره
صفحات -
تاریخ انتشار 2013